搜索资源列表
main
- 编译原理课程实验，NFA到DFA转换及化简的C++语言实现。-Compiler theory course experiment, NFA to DFA Conversion and Reduction of C++ language.
NFA
- DFA NFA 文件生成转换 C++ 制作源码-DFA NFA file to generate source code conversion C++ production
dfa-nfa
- AFN -> AFD The program convert an AFN (non-deterministic) to AFD (deterministic)
nfa
- 把NFA确定化为DFA 的算法，实现将给定的NFA M，确定化为DFA M’，然后将DFA M状态最少化，将给定的DFA M的有限状态集S划分成若干互不相交的子集，使得：任何不同的两个子集中的状态都是可区别的，而同一子集中的任何两个状态都是等价的（要利用Ia函数，但并不需要构造ε-CLOSURE函数，因这是DFA）。输出化简后的DFA M’。 -NFA into a DFA to determine the algorithm to achieve a given NFA M, to det
cifafenxi
- 1、根据要求写出词法分析的正规文法G；2、根据正规文法G，写出正则式RE；3、根据正则式RE，画出NFA；4、将NFA转化为DFA；5、将DFA转化为mininum state DFA；6、mininum state DFA就是词法分析程序的流程图，根据此流程图编写相应的词法分析程序。-1, according to the lexical analysis required to write a formal grammar G 2, according to a regular gramm
DFA
- MFC实现的正规式的输入，转化为NFA,转化为DFA,转化为最简DFA的程序-use MFC to operate something about NFA
DFA
- 将输入的正规式转换为NFA,再转换为DFA.因为时间很赶，所以结构不太合理。注释也不详细。-change from regular express to DFA
NFA-to-DFA
- Theory: NDFA: It is a mathematical model containing 5 tuples a) Q- finite non empty set elements of which are called as state. b) T- set of alphabets. c) δ- is a mapping function Q*{T {λ}}*2Q d) S-start state i.e. S ε Q e) F- F (su
zhengguishizhuanDFA
- 正规式转DFA，包括正规式转NFA，NFA转DFA等-Formal type turn DFA, including regular type turn NFA, turn NFA DFA, etc..
nfa-to-dfa
- 编译实验，实线有穷自动机，nfa到dfa-Compile the experiment, solid line finite automata, nfa to dfa
nfa
- this program will convert ndfa to dfa
DFA、NFA的java代码实现
- DFA、NFA的java代码实现，代码简单易懂，并附有可以运行的脚本文件，以及程序的说明文档-DFA, NFA' s java code, easy-to-understand code, with a scr ipt file that can be run, as well as the program' s documentation
NFA-EXCHANGE-DFA
- 确定化NFA转化为DFA，这个c++代码用于将NFA转化为DFA ,可以编译通过-The Determination of NFA into DFA
NFA-to-DFA
- NFA到DFA的转换，老师布置的作业，千辛万苦，拿出来和大家分享下-NFA to DFA conversion, the teacher assigned homework, go through untold hardships, out and share
NFA-TO-DFA
- 本文件实现的是词法分析器 使用了JAVA语言来发 希望对大家有所帮助-NFA to dfa
NFA-to-DFA
- NFA转化成DFA的课程实验，包括完整的实验理论知识，实验结果以及实验分析-The course experiment of NFA covert to DFA , including the complete experimental theoretical knowledge, experimental analysis and experimental results
FiniteAutomaton
- Java实现有限自动机相关功能的工具包，包含：正则式与NFA,DFA的相互转化；DFA的交、并、差、补运算；判断一个DFA对应的正则集是否是无限集；列出一个有限正则集所包含的所有字符串，以及包含字符串的最小长度和最大长度；判断两个最小化DFA是否等价等。 代码已开源：https://a1e2w3@bitbucket.org/a1e2w3/dfa4java.git-Java implementation of finite automata related functions toolk
NFA-DFA
- 不确定的有穷自动机转化为确定的有穷自动机的转换算法及实现-Uncertain finite automaton into a deterministic finite automaton conversion algorithm and implementation
nfa
- java语言编程，编译原理中NFA转DFA程序。-java programming language, compiler theory NFA to DFA program.
DFA
- NFA化为DFA，并将DFA最小化，输出最小化后的DFA的状态转化矩阵。-NFA into a DFA, and minimize DFA, DFA minimize output condition after transformation matrix.